Effective genetic operators of cooperative genetic algorithm for nurse scheduling

نویسندگان

  • Makoto Ohki
  • Shin-ya Uneme
  • Shigeto Hayashi
  • Masaaki Ohkita
چکیده

This paper proposes effective genetic operators for cooperative genetic algorithm (GA) to solve a nurse scheduling problem. A clinical director of a medical department makes a duty schedule of all nurses of the department every month. Such the scheduling is very complex task. It takes one or two weeks to create the nurse schedule even by a veteran director. In conventional ways using the cooperative GA, a crossover operator is only employed for the optimization, because it does not lose consistency between chromosomes. We propose a mutation operator and a virus operator for the cooperative GA, which does not lose consistency of the nurse schedule. The cooperative GA with these new operators has brought a surprisingly good result, it has never been brought by the conventional algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nurse Scheduling by Cooperative GA with Effective Virus Operator

This paper proposes effective genetic operators for cooperative genetic algorithm (GA) to solve a nurse scheduling problem. A clinical director of a medical department makes a duty schedule of all nurses of the department every month. Such the scheduling is very complex task. It takes one or two weeks to create the nurse schedule even by a veteran director. In conventional ways using the cooper...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

Staff Scheduling by a Genetic Algorithm

This paper describes a Genetic Algorithms approach to amanpower-scheduling problem arising at a Petrochemical Company. AlthoughGenetic Algorithms have been successfully used for similar problemsin the past, they always had to overcome the limitations of theclassical Genetic Algorithms paradigm in handling the conflict betweenobjectives and constraints. The approach taken here is to use an indir...

متن کامل

Solving the Dynamic Job Shop Scheduling Problem using Bottleneck and Intelligent Agents based on Genetic Algorithm

The problem of Dynamic Job Shop (DJS) scheduling is one of the most complex problems of machine scheduling. This problem is one of NP-Hard problems for solving which numerous heuristic and metaheuristic methods have so far been presented. Genetic Algorithms (GA) are one of these methods which are successfully applied to these problems. In these approaches, of course, better quality of solutions...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007